Symbolic computation of the Duggal transform

نویسندگان

  • D. Pappas Department of Statistics, Athens University of Economics and Business, 76 Patission Str, 10434, Athens, Greece
  • I. Stanimirovic Department of Computer Science, Faculty of Science and Mathematics, University of Nis, Visegradska 33, 18000 Nis, Serbia
  • V. Katsikis Department of Economics, Division of Mathematics and Informatics, National and Kapodistrian University of Athens, Athens, Greece
چکیده مقاله:

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical characteristics. The introduced algorithm is proven and illustrated in numerical examples. We also represent symbolically the Duggal transform of rank-one matrices using cross products of vectors and show that the Duggal transform of such matrices can be given explicitly by a closed formula and is equal to its Aluthge transform.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Value of Symbolic Computation

Standard generative linguistic theory, which uses discrete symbolic models of cognition, has some strengths and weaknesses. It is strong on providing a network of outposts that make scientific travel in the jungles of natural language feasible. It is weak in that it currently depends on the elaborate and unformalized use of intuition to develop critical supporting assumptions about each data po...

متن کامل

Challenges of Symbolic Computation

The success of the symbolic mathematical computation discipline is striking. The theoretical advances have been continuous and significant: Gröbner bases, the Risch integration algorithm, integer lattice basis reduction, hypergeometric summation algorithms, etc. From the beginning in the early 1960s, it has been the tradition of our discipline to create software that makes our ideas readily ava...

متن کامل

Merging Sub-symbolic and Symbolic Computation

In a recent short paper and a report (see [Neto et al. 98] and [Neto and Costa 99]) it was shown that programming languages can be translated efficiently on recurrent (analog, rational weighted) neural nets, using bounded resources. This fact was achieved by creating a neural programming language called NETDEF, such that each program corresponds to a modular neural net that computes it. This fr...

متن کامل

Numeric versus Symbolic Computation

Twentyfive years ago when I studied Physics, only one of the students who participated in a laboratory course that I took was possessing one of the first calculators to process the data we were obtaining. Believe it or not, everybody else, including me, had to use a slide-rule for this purpose. Nowadays, the calculator is used by everybody, by far not only for academic purposes. Hence it is the...

متن کامل

Symbolic Computation Software Composability

We present three examples of the composition of Computer Algebra Systems to illustrate the progress on a composability infrastructure as part of the SCIEnce (Symbolic Computation Infrastructure for Europe) project. One of the major results of the project so far is an OpenMath based protocol called SCSCP (Symbolic Computation Software Composability Protocol). SCSCP enables the various software p...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 07  شماره 01

صفحات  53- 62

تاریخ انتشار 2018-03-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023